Counting consistent phylogenetic trees is #P-complete
نویسندگان
چکیده
Reconstructing phylogenetic trees is a fundamental task in evolutionary biology. Various algorithms exist for this purpose, many of which come under the heading of ‘supertree methods.’ These methods amalgamate a collection P of phylogenetic trees into a single parent tree. In this paper, we show that, in both the rooted and unrooted settings, counting the number of parent trees that preserve all of the ancestral relationships displayed by the phylogenetic trees in P is #P-complete. 2004 Elsevier Inc. All rights reserved.
منابع مشابه
Counting Trees in a Phylogenetic Network Is \#P-Complete
Answering a problem posed by Nakhleh, we prove that counting the number of phylogenetic trees inferred by a (binary) phylogenetic network is #P-complete. An immediate consequence of this result is that counting the number of phylogenetic trees commonly inferred by two (binary) phylogenetic networks is also #P-complete.
متن کاملThe Complexity of Counting and Randomised Approximation
In this thesis we examine the complexity of counting, both exactly and approximately. We first consider counting functions in phylogenetics, and prove some intractability results. The main result in this section is that computing the number of rooted binary phylogenetic trees consistent with a given set of rooted triples is #P-complete. We also show that computing the number of consistent roote...
متن کاملApproximately Counting Locally-Optimal Structures
In general, constructing a locally-optimal structure is a little harder than constructing an arbitrary structure, but significantly easier than constructing a globally-optimal structure. A similar situation arises in listing. In counting, most problems are #P-complete, but in approximate counting we observe an interesting reversal of the pattern. Assuming that #BIS is not equivalent to #SAT und...
متن کاملEfficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data
We study a character-based phylogeny reconstruction problem when an incomplete set of data is given. More specifically, we consider the situation under the directed perfect phylogeny assumption with binary characters in which for some species the states of some characters are missing. Our main object is to give an efficient algorithm to enumerate (or list) all perfect phylogenies that can be ob...
متن کاملConstruction of a Phylogenetic Tree of Photosynthetic Prokaryotes Based on Average Similarities of Whole Genome Sequences
Phylogenetic trees have been constructed for a wide range of organisms using gene sequence information, especially through the identification of orthologous genes that have been vertically inherited. The number of available complete genome sequences is rapidly increasing, and many tools for construction of genome trees based on whole genome sequences have been proposed. However, development of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004